Keyword Query Expansion Paradigm Based on Recommendation and Interpretation in Relational Databases
نویسندگان
چکیده
منابع مشابه
Relational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملA novel keyword search paradigm in relational databases: Object summaries
Article history: Received 2 January 2010 Received in revised form 3 November 2010 Accepted 3 November 2010 Available online 23 November 2010 This paper introduces a novel keyword search paradigm in relational databases, where the result of a search is an Object Summary (OS). An OS summarizes all data held about a particular Data Subject (DS) in a database. More precisely, it is a tree with a tu...
متن کاملAKYRA: Efficient Keyword-Query Cleaning in Relational Databases
Databases often cannot find answers to keyword queries due to inconsistencies in the data or typos in the queries. Solving this problem requires efficient techniques to clean keywords in queries. In this paper we systematically study different approaches to cleaning keyword queries in relational databases. We first consider applications where we can support queries outside a database. We develo...
متن کاملA Metadata Search Approach to Keyword Query in Relational Databases
This paper proposes an effective approach to keyword query in relational databases. It uses a semantic graph model consisting of database metadata, database values, user terms, and their semantic connections.
متن کاملProbabilistic Query Expansion Method Based on a Query Recommendation Algorithm
Query Expansion Methods are proposed to solve many problems of information retrieval systems, but most of these methods do not use the information of interactions between the users and the system. In our approach, we applied a Query Recommendation Algorithm on a list of past user queries, to extract the most associated queries to the input query, and used it in a Probabilistic Query Expansion m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 2017
ISSN: 1058-9244,1875-919X
DOI: 10.1155/2017/7613026